Planar Lattices are Lexicographically Shellable

نویسنده

  • Karen L. Collins
چکیده

The special properties of planar posets have been studied, particularly in the 1970's by I. Rival and others. More recently, the connection between posets, their corresponding polynomial rings and corresponding simplicial complexes has been studied by R. Stanley and others. This paper, using work of A. Bjorner, provides a connection between the two bodies of work, by characterizing when planar posets are Cohen-Macaulay. Planar posets are lattices when they contain a greatest and a least element. We show that a nite planar lattice is lexicographically shellable and therefore Cohen-Macaulay i it is rankconnected. Every poset corresponds to a simplicial complex, called the order complex, de ned by taking chains of the poset to be faces of the simplicial complex. We de ne a face of a simplicial complex to include both interior and boundary. A pure, nite simplicial complex is shellable if its maximal faces (facets) can be ordered F1; F2; : : : ; Fn in such a way that Fk\([ k 1 i=1 Fi) is a nonempty union of maximal proper faces of Fk for 2 k n. Shellable triangulations of spheres and balls are discussed in [7]. A poset is said to be shellable if its order complex is shellable. Let k be a eld. Then with every poset P there is also associated a polynomial ring k(P ) whose variables correspond to the vertices of the poset, in which a product of two or more variables is zero if and only if it contains an independent set of vertices of the poset. Thus it is possible to ask if this ring is Cohen-Macaulay (C-M); i.e., if the depth of k(P ) is equal to the (Krull) dimension of k(P ). See [19] for background. (The Krull dimension of a polynomial ring is di erent from the combinatorial de nition of the dimension of a poset. See de nition below.) Let f be a face in a simplicial complex C, and link(f) be the subcomplex of C consisting of the set of faces g in C such that f [ g is a face in C and f \g = ;. The topological dimension of a simplicial complex is de ned to be one less than the size of its largest face. Then a simplicial complex is de ned to be C-M when for every face f in the complex C the reduced homology

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Planar and Dismantlable Lattices

All lattices are assumed to be finite. Björner [2] has shown that a dismantlable (see Rival, [5]) lattice L is Cohen-Macaulay (see [6] for definition) if and only if L is ranked and interval-connected. A lattice is planar if its Hasse diagram can be drawn in the plane with no edges crossing. Baker, Fishburn and Roberts have shown that planar lattices are dismantlable, see [1]. Lexicographically...

متن کامل

Shellable and Cohen-macaulay Partially Ordered Sets

In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including all finite semimodular and supersolvable lattices) and all bounded locally semimodular finite posets are shellable. A technique for labeling the edges of the Hasse diagram of certain lattices, due to...

متن کامل

A broad class of shellable lattices

We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples of (co)modernistic lattices. We show comodernism for two main families of lattices that were not previously known to be shellable: the order congruence latt...

متن کامل

Shellable Nonpure Complexes and Posets. I

The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have the same dimension). The usefulness of this level of generality was suggested by certain examples coming from the theory of subspace arrangements. We develop several of the basic properties of the concept of nonpure shellability. Doubly indexed f -vectors and h-vector...

متن کامل

Several Convex-Ear Decompositions

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000